Closure homomorphisms

Ramsey classes with forbidden homomorphisms and a closure

Extending classical early Ramsey-type results, the structural Ramsey theory originated at the beginning of 70ies, see [11] for references. However the list of Ramsey classes, as the top of the line of Ramsey properties, was somewhat limited. This was also supported by result of Nešetřil [7] that made a connection between Ramsey classes and ultrahomogeneous structures showing particularly that t...

Lattice Homomorphisms Induced by Group Homomorphisms

Introduction. By a lattice homorphism of a group G onto a group G' we mean a single-valued mapping of the lattice L(G) of subgroups of G onto the lattice L(G') of subgroups of G', which preserves all unions and intersections, that is, which is subject to the conditions 1. (U,S,)0 = U,(S¿), 2. (r\vSr) = Ç)ASd>), for every (finite or infinite) set of subgroups 5„ of G. We call proper any l...

POMDP Homomorphisms

The problem of finding hidden state in a POMDP and the problem of finding abstractions for MDPs are closely related. In this paper, we analyze the connection between existing Predictive State Representation methods [3] and homomorphic reductions of Markov Processes [5, 6]. We formally define a POMDP homomorphism, then extend PSR reduction methods to find POMDP homomorphisms when the original PO...

n-Homomorphisms

Enumerating Homomorphisms

The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision version of the homomorphism problem received a lot of attention in literature; in particular, the way the graph-theoretical structure of the variables and constraints influences the complexity of the problem is intensiv...